Search results for "Heuristic procedure"
showing 4 items of 4 documents
Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems
2019
In this work, we propose a heuristic procedure for a stochastic version of the uncapacitated r-allocation p-hub median problem with nonstop services. In particular, we assume that the number of hubs to which a terminal can be allocated is bounded from above by r. Additionally, we consider the possibility of shipping traffic directly between terminals (nonstop services). Uncertainty is associated with the traffic to be shipped between nodes and with the transportation costs. If we assume that such uncertainty can be captured by a finite set of scenarios, each of which with a probability known in advance, it is possible to develop a compact formulation for the deterministic equivalent proble…
A HEURISTIC APPROACH TO PART BATCHING IN FMS
1989
ABSTRACT A computationally efficient heuristic procedure is presented in order to solve the Part Batching Problem in FMS installations. The procedure is able to deal with the limited availability of tool slots in the storage devices of the machining centers and to evaluate how their capacity affects the overall system performances. A large dimension application is reported and the solution of the problem is tested using a simulator properly worked out.
Finding Satisfactory Near-Optimal Solutions in Location Problems
2003
We develope and analyze a heuristic procedure to solve a fuzzy version of the p-median problem in which we allow part of the demand not to be covered in order to reduce the transport cost. This can be used to improve a given solution of the crisp p-median problem as well as to give to the decision-maker a range of alternative locations that can be adequate according to his or her own criteria.
Balanced Asymmetrical Nearly Orthogonal Designs for first and second order effect estimation
2006
Abstract A method for constructing asymmetrical (mixed-level) designs, satisfying the balancing and interaction estimability requirements with a number of runs as small as possible, is proposed in this paper. The method, based on a heuristic procedure, uses a new optimality criterion formulated here. The proposed method demonstrates efficiency in terms of searching time and optimality of the attained designs. A complete collection of such asymmetrical designs with two- and three-level factors is available. A technological application is also presented.